Finding passwords by random walks: How long does it take?
نویسندگان
چکیده
We compare an efficiency of a deterministic " lawnmower " and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are taken from the same Q-ary alphabet. We show that at best a random search takes two times longer than a " lawnmower " search.
منابع مشابه
Random Walks II
Let G = G(V,E) be a undirected connected graph. For v ∈ V , let Γ(v) denote the neighbors of v in G. A random walk on G is the following process: Starting from a vertex v0, we randomly choose one of the neighbors of v0, and set it to be v1. We continue in this fashion, such that vi ∈ Γ(vi−1). It would be interesting to investigate the process of the random walk. For example, questions like: (i)...
متن کامل3 Stationary Distributions of Random Walks
In today’s lecture, we consider a random walk on an undirected graph. One way to think about a random walk is to imagine somebody walking through a city with no particular goal in mind. At each intersection, he or she chooses a random street to take next. We ask the questions: How long until this person reaches a particular point? How long until he/she has been to every intersection or every st...
متن کاملRandom Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful
The aim of this article is to discuss some applications of random processes in searching and reaching consensus on finite graphs. The topics covered are: Why random walks?, Speeding up random walks, Random and deterministic walks, Interacting particles and voting, Searching changing graphs. As an introductory example consider the self-stabilizing mutual exclusion algorithm of Israeli and Jalfon...
متن کاملLecture 8: Random Walks in Undirected Graphs
We introduce the notion of a random walk in an undirected graph. What happens after we take T random steps in the walk? We show how to analyze walks and their convergence properties.
متن کاملScaled Brownian motion as a mean-field model for continuous-time random walks.
We consider scaled Brownian motion (sBm), a random process described by a diffusion equation with explicitly time-dependent diffusion coefficient D(t)=αD0tα-1 (Batchelor's equation) which, for α<1, is often used for fitting experimental data for subdiffusion of unclear genesis. We show that this process is a close relative of subdiffusive continuous-time random walks and describes the motion of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0909.1051 شماره
صفحات -
تاریخ انتشار 2009